Generalization from partial parametrization in higher-order type theory
نویسندگان
چکیده
منابع مشابه
Partial Type Inference with Higher-Order Types
The language MLF is an extension of System F that permits robust first-order partial type inference with second-order polymorphism. We propose an extension of MLF’s graphical presentation with higherorder types and reduction at the type level as in System Fω. As inference of higher-order types won’t be possible in general, the extension introduces System F-style explicit type abstraction and ty...
متن کاملHigher Order Generalization
Generalization is a fundamental operation of inductive inference. While rst order syntactic generalization (anti-uni cation) is well understood, its various extensions are needed in applications. This paper discusses syntactic higher order generalization in a higher order language 2[1]. Based on the application ordering, we proved the least general generalization exists and is unique up to rena...
متن کاملHigher-order Abstract Syntax in Type Theory
We develop a general tool to formalize and reason about languages expressed using higher-order abstract syntax in a proof-tool based on type theory (Coq). A language is specified by its signature, which consists of sets of sort and operation names and typing rules. These rules prescribe the sorts and bindings of each operation. An algebra of terms is associated to a signature, using de Bruijn n...
متن کاملTowards Inductive Generalization in Higher Order Logic
øncestor(X,Z),øncestor(Z,Y)' (1) Y XYY V Z .I e s s Jhøn(X,Y ) * less-than(X,Z),lest-than(Z,Y)' (2) which are the generalisation respectiveþ of the facts lesslhan(!,3\, Iesslhan(2,4), " ' and the facts an ce stor (i ohn, st eo e), ance st or (st ea e, mi k e),''' The clauses in (1) and (2) a,re very similarjn the sense that (1) can be obtained from (2) by exchanging the pt"¿iàiu symbol ancestot...
متن کاملFuzzy type theory with partial functions
This paper is a study of fuzzy type theory (FTT) with partial functions. Out of several possibilities we decided tointroduce a special value ”∗” that represents ”undefined”. In the interpretation of FTT, this value lays outside of thecorresponding domain. In the syntax it can be naturally represented by the description operator acting on the empty(fuzzy) set, because choosing an element from it...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1989
ISSN: 0304-3975
DOI: 10.1016/0304-3975(89)90074-1